Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes
نویسندگان
چکیده
We consider in the following the problem of realizing periodic functions by a collection of finite state-agents that cooperate by interacting with each other. More formally, given a periodic non-negative integer function f that maps the set of non-negative integers N to itself, we aim in this paper at designing a distributed protocol with a state set Q and a subset S ⊆ Q, such that, for any initial configuration C0, with probability 1, there are a time instant t0 and a constant d ∈ N satisfying f(t + d) = νS(Ct) for all t ≥ t0, where νS(C) is the number of agents with a state in S in a configuration C. The model that we consider is a variant of the population protocol (PP) model in which we assume that each agent is involved in an interaction at each time instant t, hence the notion of synchronous handshakes. These additional assumptions on the model are necessary to solve the considered problem. We also assume that the interacting pairs are matched uniformly at random.
منابع مشابه
Optimal Self-stabilizing Mutual Exclusion on Synchronous Rings
We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the ring n is unknown, we better the service time by a factor of n (performing the best possible complexity for the stabilization time and the memory consumption). When the memory size is known, we pre...
متن کاملSelf-Stabilizing Graph Protocols
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.
متن کاملNode-Initiated Byzantine Consensus Without a Common Clock
The majority of the literature on consensus assumes that protocols are jointly started at all nodes of the distributed system. We show how to remove this problematic assumption in semi-synchronous systems, where messages delays and relative drifts of local clocks may vary arbitrarily within known bounds. Our framework is self-stabilizing and efficient both in terms of communication and time; mo...
متن کاملA self-stabilizing transformer for population protocols with covering
Developing self-stabilizing solutions is considered to be more challenging and complicated than developing classical solutions, where a proper initialization of the variables can be assumed. Hence, to ease the task of the developers, some automatic techniques have been proposed to design self-stabilizing algorithms. In this paper, we propose an automatic transformer for algorithms in an extende...
متن کاملStabilizing token schemes for population protocols
In this paper we address the stabilizing token circulation and leader election problems in population protocols model augmented with oracles. Population protocols is a recent model of computation that captures the interactions of biological systems. In this model emergent global behavior is observed while anonymous finite-state agents(nodes) perform local peer interactions. Uniform self-stabili...
متن کامل